A Mapping Based Approach for Multidimensional Data Indexing
نویسنده
چکیده
The most common approach to improve performance for databases is through indexing. Mapping based approach is an easy to implement paradigm for indexing multidimensional data. It does not need complicated structures or algorithms, but some transformations (mapping functions) to convert multidimensional data to one dimensional data. Then the converted data can be indexed using a robust and efficient one-dimensional index such as the B+-tree. This paper talks about a number of mapping based indexes for typical types of multidimensional queries.
منابع مشابه
Multidimensional Mapping and Indexing of XML
We propose a multidimensional approach to store XML data in relational database systems. In contrast to other efforts we suggest a solution to the problem using established database technology. We present a multidimensional mapping scheme for XML and also thoroughly study the impact of established and commercially available multidimensional index structures (compound B-Trees and UB-Trees) on th...
متن کاملMultidimensional indexing and querying of XML in digital libraries and relational database systems
The rise of XML (Extensible Markup Language) as a new universal data format created the demand to store XML with established relational database technology. This became even more important as application fields of relational databases like digital library systems also turned towards a massive use of XML. This work presents an approach to map XML data to a relational schema. The mapping uses an ...
متن کاملOn Indexing Multidimensional Data In A P2P Context
Based on their remarkable properties (fault tolerance, scalability, decentralization), P2P systems tend to be largely accepted as a common support for deploying massively distributed data management applications. Some of the existing P2P systems are built over hybrid networks where certain peers are specialized in indexing. Others make use of DHTs as common support for data indexing. However, o...
متن کاملAdvanced Indexing Techniques for Achieving Concurrency in Multidimensional Data Sets
In multidimensional datasets concurrent accesses to data via indexing structures introduce the problem protecting ranges specified in the retrieval from phantom insertions and deletions. This paper proposes a novel approach for concurrency in multidimensional datasets using Advanced Indexing Technique like generalized search tree, R tree and its variants, constitutes an efficient and sound conc...
متن کاملOptimal Multidimensional Query Processing Using Tree Striping
In this paper, we propose a new technique for multidimensional query processing which can be widely applied in database systems. Our new technique, called tree striping, generalizes the well-known inverted lists and multidimensional indexing approaches. A theoretical analysis of our generalized technique shows that both, inverted lists and multidimensional indexing approaches, are far from bein...
متن کامل